backward search

backward search
wyszukiwanie wstecz
wyszukiwanie wsteczne

English-Polish dictionary of Electronics and Computer Science. 2013.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Backward induction — is the process of reasoning backwards in time, from the end of a problem or situation, to determine a sequence of optimal actions. It proceeds by first considering the last time a decision might be made and choosing what to do in any situation at …   Wikipedia

  • Backward chaining — (or backward reasoning) is an inference method used in artificial intelligence. It is one of two methods of reasoning that uses inference rules – the other is forward chaining, also known as modus ponens. Backward chaining is implemented in logic …   Wikipedia

  • Jump search — In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items L km , where k in mathbb{N} and m is the block size, until an item is found that is larger than the search key …   Wikipedia

  • Bidirectional search — is a graph search algorithm that runs two simultaneous searches: one forward from the initial state, and one backward from the goal, and stopping when the two meet in the middle. The reason for this approach is that each of the two searches has… …   Wikipedia

  • In Search of the Cradle of Civilization — In Search of the Cradle of Civilization: New Light on Ancient India is a 1995 book by Georg Feuerstein, Subhash Kak, and David Frawley that argues against the theories that Indo European peoples arrived in India in the middle of the second… …   Wikipedia

  • D* search algorithm — In computer science and robotics, the D* algorithm (pronounced D star ) is a dynamic version of the backward variant of Dijkstra s algorithm and A* search algorithm. Also known as Stentz s Algorithm, it was first developed by Anthony Stentz in… …   Wikipedia

  • Snake-in-the-box — The snake in the box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube. This path starts at one corner and travels along the edges to as many corners as it can reach. After it… …   Wikipedia

  • ГОСТ Р ИСО/МЭК 2382-23-2004: Информационная технология. Словарь. Часть 23. Обработка текста — Терминология ГОСТ Р ИСО/МЭК 2382 23 2004: Информационная технология. Словарь. Часть 23. Обработка текста оригинал документа: 23.06.22 автоматическая нумерация параграфов [automatic paragraph numbering]: Возможность текстового процессора… …   Словарь-справочник терминов нормативно-технической документации

  • поиск — 23.04.12 поиск* [search (find)]: Функция или режим, который позволяет пользователю обнаруживать определенные последовательности знаков (символов), встроенные команды или знаки с определенными атрибутами в тексте. Источник: ГОСТ Р ИСО/МЭК 2382 23… …   Словарь-справочник терминов нормативно-технической документации

  • поиск в обратном направлении — Функция или режим, который позволяет проводить поиск с любого места документа с возвратом к началу документа. [ГОСТ Р ИСО/МЭК 2382 23 2004] Тематики обработка текста Обобщающие термины редактирование текста EN backward search (reverse search,… …   Справочник технического переводчика

  • поиск в обратном направлении — 23.04.15 поиск в обратном направлении [backward search (reverse search, reverse find)]: Функция или режим, который позволяет проводить поиск с любого места документа с возвратом к началу документа. Источник: ГОСТ Р ИСО/МЭК 2382 23 2004:… …   Словарь-справочник терминов нормативно-технической документации

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”